Definability and decidability of binary predicates for time granularity
نویسندگان
چکیده
In this paper we study the definability and decidability of binary predicates for time granularity in monadic languages interpreted over finitely and infinitely layered structures. We focus our attention on the equi-level (resp. equi-column) predicate constraining two time points to belong to the same layer (resp. column) and on the horizontal (resp. vertical) successor predicate relating a time point to its successor within a given layer (resp. column). We give a number of positive and negative results by reduction to/from a wide spectrum of decidable/undecidable problems.
منابع مشابه
Alternation Hierarchies of First Order Logic with Regular Predicates
We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with regular numerical predicates. In this paper, we focus on the quantifier alternation hierarchies of first order logic. We obtain that deciding this problem for each level of the alternation hierarchy of both first order logic and its twovariable fragment when equipped wi...
متن کاملDecidability and Complexity of Definability within the Class of All Partitions
This paper is devoted to exploring modal definability of firstorder sentences and first-order definability of modal formulas. It investigates the decidability and the complexity of these problems within the class of all partitions.
متن کاملReasoning about negligibility and proximity
In this paper, we consider the binary relations of negligibility, comparability and proximity in the set of all hyperreals. Associating with them the binary predicates N , C and P and the operators [N ], [C] and [P ], we consider a first-order theory based on these predicates and a modal logic based on these operators. We investigate the axiomatization/completeness and the decidability/complexi...
متن کاملLine-Based Affine Reasoning in Euclidean Plane
We consider the binary relations of parallelism and convergence between lines in a 2-dimensional affine space. Associating with parallelism and convergence the binary predicates P and C and the modal connectives [P ] and [C], we consider a first-order theory based on these predicates and a modal logic based on these modal connectives. We investigate the axiomatization/completeness and the decid...
متن کاملDefining Recursive Predicates in Graph Orders
We study the first order theory of structures over graphs i.e. structures of the form (G, τ ) where G is the set of all (isomorphism types of) finite undirected graphs and τ some vocabulary. We define the notion of a recursive predicate over graphs using Turing Machine recognizable string encodings of graphs. We introduce the notion of a capable structure over graphs, which is one satisfying th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003